A new decoding algorithm for geometrically uniform trellis codes
نویسندگان
چکیده
A new decoding algorithm for geomelrically uniform trellis codes exploiting the group structure of the codes is presented. The algorithm complexity does not depend on the number of states of the trellis describing the code. Performance of the algorithm are evaluated through simulation, and its complexity is compared to the Viterbi algorithm.
منابع مشابه
A New Decoding Algorithm for Geometrically Uniform Trellis Codes - Communications, IEEE Transactions on
A new decoding algorithm for geometrically uniform trellis codes is presented. The group structure of the codes is exploited in order to improve the decoding process. Analytical bounds to the algorithm performance and to its computational complexity are derived. The algorithm complexity does not depend on the number of states of the trellis describing the code. Extensive simulations yield resul...
متن کاملGeometrically uniform partitions of L×MPSK constellations and related binary trellis codes
The recently developed theory of geometrically uniform trellis codes is applied to the case of multidimensional PSK constellations. The symmetry group of an L X MPSK constellation is completely characterized. Conditions for rotational invariance of geometrically uniform partitions of a signal constellation are given. Through suitable algorithms, geometrically uniform partitions of L X MPSK ( M ...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملPerformance of Hybrid Concatenated Trellis Codes CPFSK with Iterative Decoding over Fading Channels
Concatenation is a method of building long codes out of shorter ones, it attempts to meet the problem of decoding complexity by breaking the required computation into manageable segments. Concatenated Continuous Phase Frequency Shift Keying (CPFSK) facilitates powerful error correction. CPFSK also has the advantage of being bandwidth efficient and compatible with non-linear amplifiers. Bandwidt...
متن کاملSOVA Based on a Sectionalized Trellis of Linear Block Codes
The use of block codes is a well known error-control technique for reliable transmission of digital information over noisy communication channels. However, a practically implementable softinput soft-output (SISO) decoding algorithm for block codes is still a challenging problem. This thesis examines a new decoding scheme based on the soft-output Viterbi algorithm (SOVA) applied to a sectionaliz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Communications
دوره 44 شماره
صفحات -
تاریخ انتشار 1996